Proofs of central-difference interpolation formulas
نویسندگان
چکیده
منابع مشابه
Combinatorial Proofs of Addition Formulas
In this paper we give a combinatorial proof of an addition formula for weighted partial Motzkin paths. The addition formula allows us to determine the LDU decomposition of a Hankel matrix of the polynomial sequence defined by weighted partial Motzkin paths. As a direct consequence, we get the determinant of the Hankel matrix of certain combinatorial sequences. In addition, we obtain an addition...
متن کاملConstructing Craig Interpolation Formulas
1 Background and Introduction Let 27 and H be two inconsistent first order theories. Then by Craig's Interpolation Theorem, there is a sentence 8, called a Craig interpolant, such that 8 is t rue in 27 and false in H and every nonlogical symbol occurring in 8 occurs in bo th 27 and H. Craig interpolants can be used to solve the problem of learning a first order concept by letting 27 and H be th...
متن کاملSplitting Proofs for Interpolation
We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the common signature. This allows us to highlight the space of all interpolants that can be extracted from a refutation as a space of simple choices on how to split the r...
متن کاملStability of Barycentric Interpolation Formulas
The barycentric interpolation formula defines a stable algorithm for evaluation at points in [−1, 1] of polynomial interpolants through data on Chebyshev grids. Here it is shown that for evaluation at points in the complex plane outside [−1, 1], the algorithm becomes unstable and should be replaced by the alternative modified Lagrange or “first barycentric” formula dating to Jacobi in 1825. Thi...
متن کاملFinite Proofs for Infinitary Formulas
Recent work has shown that the infinitary logic of hereand-there is closely related to the input language of the ASP grounder gringo. A formal system axiomatizing that logic exists, but a proof in that system may include infinitely many formulas. In this note, we define a correspondence between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1982
ISSN: 0021-9045
DOI: 10.1016/0021-9045(82)90035-1